//给你一个 m 行 n 列的矩阵 matrix ，请按照 顺时针螺旋顺序 ，返回矩阵中的所有元素。 
//
// 
//
// 示例 1： 
//
// 
//输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
//输出：[1,2,3,6,9,8,7,4,5]
// 
//
// 示例 2： 
//
// 
//输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
//输出：[1,2,3,4,8,12,11,10,9,5,6,7]
// 
//
// 
//
// 提示： 
//
// 
// m == matrix.length 
// n == matrix[i].length 
// 1 <= m, n <= 10 
// -100 <= matrix[i][j] <= 100 
// 
// Related Topics 数组 矩阵 模拟 
// 👍 914 👎 0


package leetcode.editor.cn;

import java.util.ArrayList;
import java.util.List;

public class SpiralMatrix{
  public static void main(String[] args) {
       Solution solution = new SpiralMatrix().new Solution();
       int[][] matrix = {{2,5},{4,0},{1,9}};
       List<Integer> list = new ArrayList<Integer>();
       list = solution.spiralOrder(matrix);
       System.out.println(list.toString());
  }
  //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> list = new ArrayList<Integer>();
        int left = 0;
        int right = matrix[0].length - 1;
        int top = 0;
        int bottom = matrix.length - 1;
        while (true) {
            //向右
            for (int i=left; i<=right; i++){
                list.add(matrix[top][i]);
            }
            top++;
            if (top > bottom){
                break;
            }
            //向下
            for (int i=top; i<=bottom; i++){
                list.add(matrix[i][right]);
            }
            right--;
            if (left > right){
                break;
            }
            //向左
            for (int i=right; i>=left; i--){
                list.add(matrix[bottom][i]);
            }
            bottom--;
            if (bottom < top){
                break;
            }
            //向上
            for (int i=bottom; i>=top; i--){
                list.add(matrix[i][left]);
            }
            left++;
            if (left > right){
                break;
            }
        }
        return list;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}